

import java.util.Arrays;
import java.util.Scanner;

/*归并排序*/
public class MergeSort {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {

            String[] s = sc.nextLine().trim().split(" ");
            int len = s.length;
            int[] nums = new int[len];
            for (int i = 0; i < len; i++) {
                nums[i] = Integer.parseInt(s[i]);
            }
            mergeSort(nums, 0, len-1);
            System.out.println(Arrays.toString(nums));
        }
    }


    public static void mergeSort(int[] arr, int l, int r) {
        if (l >= r) {
            return ;
        }
        int mid = (l + r) / 2;
        mergeSort(arr, l, mid);
        mergeSort(arr, mid + 1, r);
        merge(arr, l, mid, r);

    }

    public static void merge(int[] arr, int l, int mid, int r) {
        int[] temp = new int[r - l + 1];
        int i = l, j = mid+1, k = 0;
        while (i <= mid && j <= r) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
            }
        }

        while (j <= r) {
            temp[k++] = arr[j++];
        }


        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        for (int m = 0; m < r - l + 1; m++) {
            arr[m + l] = temp[m];
        }
    }



}